Lattice Option Pricing By Multidimensional Interpolation
نویسنده
چکیده
This note proposes a method for pricing high-dimensional American options based on modern methods of multidimensional interpolation. The method allows using sparse grids and thus mitigates the curse of dimensionality. A framework of the pricing algorithm and the corresponding interpolation methods are discussed, and a theorem is demonstrated that suggests that the pricing method is less vulnerable to the curse of dimensionality. The method is illustrated by an application to rainbow options and compared to Least Squares Monte Carlo and other benchmarks. The fundamental problem of options theory is the valuation of hybrid, non-linear securities, and options theory is an ingenious but glorified method of interpolation. Emanuel Derman “A guide for the perplexed quant”
منابع مشابه
Spatial Interpolation for Lattice Option Pricing – or Well Pruned Bushy Trees
This paper proposes a novel lattice method of option valuation that is especially suitable to American-style options whose values depend on multiple factors. The key to the method is multidimensional interpolation, which allows using sparse lattices and thus mitigates the curse of dimensionality. A pricing algorithm and suitable methods of interpolation are discussed in detail. Some results abo...
متن کاملA reduced lattice model for option pricing under regime-switching
We present a binomial approach for pricing contingent claims when the parameters governing the underlying asset process follow a regime-switching model. In each regime, the asset dynamics is discretized by a Cox-Ross-Rubinstein lattice derived by a simple transformation of the parameters characterizing the highest volatility tree, which allows a simultaneous representation of the asset value in...
متن کاملA convergent quadratic-time lattice algorithm for pricing European-style Asian options
Asian options are strongly path-dependent derivatives. Although efficient numerical methods and approximate closedform formulas are available, most lack convergence guarantees. Asian options can also be priced on the lattice. All efficient lattice algorithms keep only a polynomial number of states and use interpolation to compensate for the less than full representation of the states. Let the t...
متن کاملA Scaling Algorithm of Self-avoiding Chain Adsorbed on the Surface
A single polymer chain with one end tethered to an impenetrable flat surface is simulated by using Monte Carlo simulation method. The polymer chain is generated using self-avoiding walk method in the simple cubic lattice. The monomer does Brownian motion by the bondfluctuation method in the simulation. After a long Monte Carlo step, the conformation of the chain reaches equilibrium. There is a ...
متن کاملPricing American-Style Derivatives with European Call Options1
We present a new approach to pricing American-style derivatives that is applicable to any Markovian setting (i.e., not limited to geometric Brownian motion) for which European call option prices are readily available. By approximating the value function with an appropriately chosen interpolation function, the pricing of an American-style derivative with arbitrary payoff function is converted to...
متن کامل